High Storage Utilisation for Single-Probe Retrieval Linear Hashing
نویسندگان
چکیده
منابع مشابه
Performance of Linear Hashing Schemes for Primary Key Retrieval
Linear hashing is one of the most attractive dynamic hashing schemes. Linear hashing with partial expansions and linear hashing with priority splitting are two variations with improved space and time performance. Here, we propose a new structure, which is termed linear hashing with partial expansions and priority splitting. The above four structures are compared by simulation and it is shown th...
متن کاملOptimal Linear Hashing Files for Orthogonal Range Retrieval
In this paper, we are concerned with the problem of designing optimal linear hashing files for orthogonal range retrieval. Through the study of performance expressions, we show that optimal basic linear hashing files and optimal recursive linear hashing files for orthogonal range retrieval can be produced, in certain cases, by a greedy method called the MMI (minimum marginal increase) method; a...
متن کاملMulti-probe consistent hashing
1 Abstract We describe a consistent hashing algorithm which performs multiple lookups per key in a hash table of nodes. It requires no additional storage beyond the hash table, and achieves a peak-to-average load ratio of 1 + ε with just 1 + 1 ε lookups per key.
متن کاملRetrieval–travel-time model for free-fall-flow-rack automated storage and retrieval system
Automated storage and retrieval systems (AS/RSs) are material handling systems that are frequently used in manufacturing and distribution centers. The modelling of the retrieval–travel time of an AS/RS (expected product delivery time) is practically important, because it allows us to evaluate and improve the system throughput. The free-fall-flow-rack AS/RS has emerged as a new technology for dr...
متن کاملLH* — Linear Hashing for
LH* generalizes Linear Hsshing to parallel or distributed RAM and disk files. An LH* file can be created from objects provided by any number of distributed and autonomous clients. It can grow gracefully, one bucket at a time, to virtually any number of servers. The number of messages per insertion is one in general, and three in the worst case. The number of messages per retrieval is two in gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1991
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/34.5.455